A (restricted) quantifier elimination for security protocols
نویسندگان
چکیده
منابع مشابه
A (restricted) quantifier elimination for security protocols
While reasoning about security protocols, most of the difficulty of reasoning relates to the complicated semantics (with freshness of nonces, multisessions etc). While logics for security protocols need to be abstract (without explicitly dealing with nonces, encryption etc), ignoring details may result in rendering any verification of abstract properties worthless. We would like the verificatio...
متن کاملQuantifier Elimination and Information Flow Control for Software Security
Program Dependency Graphs and Constraint Solving can be combined to achieve a powerful tool for information flow control, allowing to check source code for security problems such as external manipulation of critical computations. The method generates path conditions for critical information flows, being conditions over the program variables necessary for flow. As all variables are existentially...
متن کاملQuantifier Elimination for Quartics
Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formula...
متن کاملQuantifier Elimination
Quantifier elimination (QE) is a very powerful procedure for problems involving firstorder formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...
متن کاملQuantifier Elimination for Linear Arithmetic
This article formalizes quantifier elimination procedures for dense linear orders, linear real arithmetic and Presburger arithmetic. In each case both a DNF-based non-elementary algorithm and one or more (doubly) exponential NNF-based algorithms are formalized, including the well-known algorithms by Ferrante and Rackoff and by Cooper. The NNF-based algorithms for dense linear orders are new but...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.08.037